Papers with optimization strategies
Numerical Optimizations for Weighted Low-rank Estimation on Language Models (2022.emnlp-main)
Copied to clipboard
| Challenge: | Singular value decomposition (SVD) is one of the most popular methods for estimating a target matrix with smaller matrices. |
| Approach: | They propose a method that approximates a target matrix with smaller matrices by two smaller . they also propose metric to predict when the SVD may introduce a significant performance drop. |
| Outcome: | The proposed method can perform better than current SOTA methods in compressing Transformer-based language models. |
Marathon: A Race Through the Realm of Long Context with Large Language Models (2024.acl-long)
Copied to clipboard
| Challenge: | Existing long-context benchmarks do not accurately evaluate large language models’ comprehension and reasoning abilities in extended texts. |
| Approach: | They propose a new evaluation benchmark that adopts a multiple-choice question format and uses a multi-choke question format to assess the comprehension and reasoning skills of large language models. |
| Outcome: | The proposed benchmark provides a rapid, precise, and unbiased appraisal of the long-context comprehension skills of large language models. |
Enhancing Language Model Hypernetworks with Restart: A Study on Optimization (2025.naacl-long)
Copied to clipboard
| Challenge: | a comprehensive investigation into optimization strategies for hypernetworks remains lacking. |
| Approach: | They propose restart optimization strategies to improve hypernetworks' performance for language models. |
| Outcome: | The proposed restart strategy improves hypernetworks' performance for language models, compared to conventional deep neural networks. |
LongRecipe: Recipe for Efficient Long Context Generalization in Large Language Models (2025.acl-long)
Copied to clipboard
Zhiyuan Hu, Yuliang Liu, Jinman Zhao, Suyuchen Wang, WangYan WangYan, Wei Shen, Qing Gu, Anh Tuan Luu, See-Kiong Ng, Zhiwei Jiang, Bryan Hooi
| Challenge: | Large language models face significant challenges in handling long-context tasks because of their limited effective context window size during pretraining, which restricts their ability to generalize over extended sequences. |
| Approach: | They propose a training strategy for extending the context window of LLMs including impactful token analysis, position index transformation, and training optimization strategies. |
| Outcome: | Experiments on three types of LLMs show that LongRecipe can utilize long sequences while requiring only 30% of the target context window size. |
ReSo: A Reward-driven Self-organizing LLM-based Multi-Agent System for Reasoning Tasks (2025.emnlp-main)
Copied to clipboard
| Challenge: | Multi-agent systems (MAS) are limited by poor flexibility and scalability, with underdeveloped optimization strategies. |
| Approach: | They propose a task graph generation and a reward-driven two-stage agent selection process to integrate multi-agent systems to improve their reasoning capabilities. |
| Outcome: | The proposed model outperforms existing methods on Math-MAS and SciBench-MAS SciBech, while other methods completely fail. |
LangProBe: a Language Program Benchmark (2025.findings-emnlp)
Copied to clipboard
Shangyin Tan, Lakshya A Agrawal, Arnav Singhvi, Liheng Lai, Michael J Ryan, Dan Klein, Omar Khattab, Koushik Sen, Matei Zaharia
| Challenge: | Composing language models into multi-step language programs is a mainstream paradigm for building AI systems, but tradeoffs in this space have only scarcely been studied before. |
| Approach: | They propose a benchmarking tool to evaluate the architectures and optimization strategies for language programs . they find that optimized language programs offer strong cost-quality Pareto improvement . |
| Outcome: | The proposed framework evaluates the impact of program architectures and optimizers on quality and cost. |
Learning to Evolve: A Self-Improving Framework for Multi-Agent Systems via Textual Parameter Graph Optimization (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for designing and optimizing multi-agent systems are static and do not learn from experience. |
| Approach: | They propose a framework that enables a multi-agent system to learn to evolve . they use "textual gradients" to pinpoint failures and suggest granular modifications . |
| Outcome: | a new framework enables a multi-agent system to learn to evolve . it learns from historical optimization experiences to improve its performance . |